On the Cameron-Praeger conjecture
نویسنده
چکیده
This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no nontrivial block-transitive 6-designs. We prove that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6-(v, k, λ) designs with λ = 1, except possibly when the group is PΓL(2, pe) with p = 2 or 3, and e is an odd prime power.
منابع مشابه
Vertex stabilizers of nite symmetric graphs and a strong version of the Sims conjecture
Well known Sims conjecture proved by P. J. Cameron, C. E. Praeger, J. Saxl and G. M. Seitz (1983) can be formulated as follows. Let be an undirected connected nite graph and G be a subgroup of Aut acting primitively on the vertex set V ( ) of . For x 2 V ( ) and positive integer i, denote by G x the point-wise stabilizer in G of the closed ball of the radius i with the center x of the graph . T...
متن کاملOn the Sims Conjecture and Distance Transitive Graphs
Charles Sims suggested that this should be true in [11]. Much work has been done since—see for instance the papers of Thompson [15], Wielandt [17] and Knapp [6]. In particular, Thompson proved in [15] the existence of a function g such that for any G as above there is a prime p and a normal p-subgroup P of G with |Ga: P\ ^ g(d). Nevertheless, the conjecture has remained open until now. As a con...
متن کاملOn the Weiss Conjecture for Finite Locally Primitive Graphs
A graph F is said to be locally primitive if, for each vertex a, the stabilizer in Aut F of a induces a primitive permutation group on the set of vertices adjacent to a. In 1978, Richard Weiss conjectured that for a finite vertex-transitive locally primitive graph F, the number of automorphisms fixing a given vertex is bounded above by some function of the valency of F. In this paper we prove t...
متن کاملOn Minimal Faithful Permutation Representations of Finite Groups
The minimal faithful permutation degree n(G) of a finite group G is the least positive integer n such that G is isomorphic to a subgroup of the symmetric group Sn. Let AT be a normal subgroup of a finite group G. We prove that n(G/N) $C /i(G) if G/N has no nontrivial Abelian normal subgroup. There is an as yet unproved conjecture that the same conclusion holds if G/N is Abelian. We investigate ...
متن کاملAn Infinite Highly Arc-transitive Digraph
The main purpose of this note is to construct an infinite , highly arc-transitive digraph with finite out-valency , and with out-spread greater than 1 , which does not have the two-way infinite path Z as a homomorphic image . This answers Question 3 . 8 in the paper [3] of Cameron , Praeger and Wormald . Our digraph has infinite in-valency . By a result of Praeger (see [5]) , a connected , vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 117 شماره
صفحات -
تاریخ انتشار 2010